DRAM architecture for efficient data lifetime management
نویسندگان
چکیده
منابع مشابه
Hybrid XML data model architecture for efficient document management
XML has been known as a document standard in representation and exchange of data on the Internet, and is also used as a standard language for the search and reuse of scattered documents on the Internet. The issues related to XML are how to model data on effective and efficient management of semi-structured data and how to actually store the modeled data when implementing a XML contents manageme...
متن کاملDecoupled Access DRAM Architecture
This paper discusses an approach to reducing mem ory latency in future systems It focuses on systems where a single chip DRAM processor will not be fea sible even in years e g systems requiring a large memory and or many CPU s In such systems a solu tion needs to be found to DRAM latency and bandwidth as well as to inter chip communication Utilizing the projected advances in chip I O bandwidth ...
متن کاملDRAM: Efficient adaptive MCMC
We propose to combine two quite powerful ideas that have recently appeared in the Markov chain Monte Carlo literature: adaptive Metropolis samplers and delayed rejection. The ergodicity of the resulting non–Markovian sampler is proved, and the efficiency of the combination is demonstrated with various examples. We present situations where the combination outperforms the original methods: adapta...
متن کاملEfficient VLSI Architecture for ECG Data Compression
This paper presents an efficient ECG signals compression techniques using a 2D DWT coefficient thresholding and its design implementation of an efficient JPEG2000 encoder that employs the Distributed Arithmetic (DA) technique for the complex computation of Discrete Wavelet Transform (DWT).2D approaches exploit the fact that redundancy of ECG signal occurs between adjacent beats and adjacent sam...
متن کاملEfficient VLSI Architecture for Lossless Data Compression
An architecture for LZ1-type lossless data compression is described. The architecture is area-efficient and fast since it exploits the locality of substring match lengths. The property has been shown experimentally for various data and buffer lengths, and an architecture based on it has been designed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2017
ISSN: 1349-2543
DOI: 10.1587/elex.14.20170309